Multiprocessor task scheduling problem using hybrid discrete particle swarm optimization
نویسندگان
چکیده
منابع مشابه
Task Scheduling in Distributed Systems using Discrete Particle Swarm Optimization
Finding an optimal schedule of tasks for an application in distributed environment is critical in general. Task assignment is an extremely NP complete problem. This type of problem can be resolved by heuristic algorithms efficiently because the traditional methods such as dynamic programming and the back tracking need more time for solving this NP complete problem. Particle Swarm Optimization (...
متن کاملImproved Particle Swarm Optimization for Solving Multiprocessor Scheduling Problem: Enhancements and Hybrid Methods
Memetic algorithms (MAs) are hybrid evolutionary algorithms (EAs) that combine global and local search by using an EA to perform exploration while the local search method performs exploitation. Combining global and local search is a strategy used by many successful global optimization approaches, and MAs have in fact been recognized as a powerful algorithmic paradigm for evolutionary computing....
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملHybrid Particle SWARM Optimization for Solving Machine Time Scheduling Problem
A hybrid particle swarm optimization (PSO) for multi-machine time scheduling problem (MTSP) with multicycles is proposed in this paper to choose the best starting time for each machine in each cycle under pre-described time window and a set of precedence machines for each machine; to minimize the total penalty cost. We developed hybrid algorithm by using a combination between PSO and Genetic Al...
متن کاملHybrid Discrete Particle Swarm Optimization for Task Scheduling in Grid Computing
Computational Grid is a high performance computing environment that participating machines resources are used through software layer as transparent and reliable. Task assignment problem in Grid Computing is a NP-Complete problem that has been studied by several researchers. The most common objective functions of task scheduling problems are Makespan and Flowtime. This paper gives a classificati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sādhanā
سال: 2018
ISSN: 0256-2499,0973-7677
DOI: 10.1007/s12046-018-0984-x